class Solution {
public:
    int search(vector<int>& nums, int target) {
        int left = 0, right = nums.size() - 1;
        while (left <= right)
        {
            int mid = (right - left) / 2 + left;
            if (nums[mid] == target)
                return mid;
            else if (nums[mid] > target)
            {
                if (target > nums.back())
                    right = mid - 1;
                else
                {
                    if (nums[mid] > nums.back())
                        left = mid + 1;
                    else
                        right = mid - 1;
                }
            }
            else
            {
                if (target > nums.back())
                {
                    if (nums[mid] <= nums.back())
                        right = mid - 1;
                    else
                        left = mid + 1;
                }
                else
                {
                    left = mid + 1;
                }
            }
        }

        return -1;
    }
};